Infinite-server Queues with Batch Arrivals and Dependent Service Times

نویسنده

  • Guodong Pang
چکیده

Motivated by large-scale service systems, we consider an infinite-server queue with batch arrivals, where the service times are dependent within each batch. We allow the arrival rate of batches to be time-varying as well as constant. As regularity conditions, we require that the batch sizes be i.i.d. and independent of the arrival process of batches, and we require that the service times within different batches be independent. We exploit a recently established heavy-traffic limit for the number of busy servers to determine the performance impact of the dependence among the service times. The number of busy servers is approximately a Gaussian process. The dependence among the service times does not affect the mean number of busy servers, but it does affect the variance of the number of busy servers. Our approximations quantify the performance impact upon the variance. We conduct simulations to evaluate the heavy-traffic approximations for the stationary model and the model with a time-varying arrival rate. In the simulation experiments, we use the Marshall-Olkin multivariate exponential distribution to model dependent exponential service times within a batch. We also introduce a class of Marshall-Olkin multivariate hyperexponential distributions to model dependent hyperexponential service times within a batch.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Study on State Dependent Accessible and Second Optional Service Queue with Impatient and Feedback Customers

In this paper, we study a single server Markovian queue with state dependent accessible services, reneging and feedback of customers. The server can accommodate at the most $d$ customers in the service station, after which the new arrivals have to wait in the primary queue of infinite waiting space. All arrivals demand First Essential Service (FES), after completing FES, customers decide to joi...

متن کامل

Cd Some Results for Infinite Server Poisson Queues

A generalization of the M/G/« queueing system with batch arrivals to one with time dependent arrival rates, service times, and batch size distributions is considered. It is shown that both W(t) , the number of people being served at t , and S(t) , the number of people who have completed service by t , are distributed as compound Poisson laws. The distributions of the traffic time average -1 T T...

متن کامل

Infinite Server Queues with Synchronized Departures Driven by a Single Point Process

We analyze an infinite-server queueing model with synchronized arrivals and departures driven by the point process {Tn} according to the following rules. At time Tn, a single customer (or a batch of size βn) arrives to the system. The service requirement of the ith customer in the nth batch is σi,n. All customers enter service immediately upon arrival but each customer leaves the system at the ...

متن کامل

Fluid Queues Driven by a Discouraged Arrivals Queue

We consider a fluid queue driven by a discouraged arrivals queue and obtain explicit expressions for the stationary distribution function of the buffer content in terms of confluent hypergeometric functions. We compare it with a fluid queue driven by an infinite server queue. Numerical results are presented to compare the behaviour of the buffer content distributions for both these models. 1. I...

متن کامل

Analysis of an Infinite-Server Queue with Batch Markovian Arrival Streams

This paper considers an infinite-server queue with multiple batch Markovian arrival streams. The service time distribution of customers may be different for different arrival streams, and simultaneous batch arrivals from more than one stream are allowed. For this queue, we first derive a system of ordinary differential equations for the time-dependent matrix joint generating function of the num...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011